Factored Envisioning1
نویسندگان
چکیده
Envisioning has been used extensively to model behavior of physical systems. Envisioning generates the qualitatively distinct possible behaviors without numerically simulating every possible set of input conditions and model parameters. This paper applies envisioning to analyze course of action (COA) diagrams to determine the qualitatively distinct outcomes of military operations. In order to avoid the combinatorial explosion of possible states, this envisioner factors non-interacting units into separate envisionment threads. The envisioner uses Assumption-Based Truth Maintenance to further limit combinatorial explosion and estimate probability of outcomes. We illustrate the performance of the factored envisioner on a variety of examples provided by military experts. We analyze its scaling performance and demonstrate its ability to track operations from sparse observations. Sponsored by Defense Advanced Research Projects Agency
منابع مشابه
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملOdd 2-factored snarks
A snark is a cubic cyclically 4–edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2–factored if for each 2–factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2–factored snarks. In particular, we construct two new odd 2–factored snarks that disprove a conjecture by some of the authors. Moreover, w...
متن کاملFactored Upper Bounds for Multiagent Planning Problems under Uncertainty with Non-Factored Value Functions
Nowadays, multiagent planning under uncertainty scales to tens or even hundreds of agents. However, current methods either are restricted to problems with factored value functions, or provide solutions without any guarantees on quality. Methods in the former category typically build on heuristic search using upper bounds on the value function. Unfortunately, no techniques exist to compute such ...
متن کاملUsing mathematical programming to solve Factored Markov Decision Processes with Imprecise Probabilities
This paper investigates Factored Markov Decision Processes with Imprecise Probabilities (MDPIPs); that is, Factored Markov Decision Processes (MDPs) where transition probabilities are imprecisely specified. We derive efficient approximate solutions for Factored MDPIPs based on mathematical programming. To do this, we extend previous linear programming approaches for linear approximations in Fac...
متن کامل